منابع مشابه
Random cuts in binary mixtures of spheres.
Three-dimensional (3D) disordered media may be studied by performing random planar cuts through the material and trying to go back to 3D geometry from two-dimensional information. We have studied from this point of view numerical packings of spheres of two sizes for which the radii of the spheres and the composition of the mixtures have been obtained from the cuts. We have also studied the frot...
متن کاملExtremal Cuts of Sparse Random Graphs
For Erdős-Rényi random graphs with average degree γ, and uniformly random γ-regular graph on n vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are n( γ 4 + P∗ √ γ 4 + o( √ γ)) + o(n) while the size of the minimum bisection is n( γ 4 − P∗ √ γ 4 + o( √ γ)) + o(n). Our derivation relates the free energy of the anti-ferromagnetic Ising model on such ...
متن کاملFinding Small Sparse Cuts by Random Walk
We study the problem of finding a small sparse cut in an undirected graph. Given an undirected graph G = (V,E) and a parameter k ≤ |E|, the small sparsest cut problem is to find a set S ⊆ V with minimum conductance among all sets with volume at most k. Using ideas developed in local graph partitioning algorithms, we obtain the following bicriteria approximation algorithms for the small sparsest...
متن کاملA New Tree Clustering Algorithm for Fuzzy Data Based on α-cuts
This paper presents a new approach to clustering fuzzy data, called Extensional Tree (ET) clustering algorithm by defining a dendrogram over fuzzy data and using a new metric between fuzzy numbers based on α-cuts. All the similar previous methods extended FCM to support fuzzy data. The present work is based on hierarchical clustering algorithm to cluster fuzzy data. In this novel approach a den...
متن کاملHow to Use Random Circulations to Find Small Cuts
Let K be an abelian group and G be a connected graph, both finite. Using basic properties of circulations, we show that it is easy to generate uniformly random K-circulations on G. This leads to efficient algorithms for computing the cut edges, cut edge-pairs, and cut vertices of a graph; for example, the cut edges are “usually” the edges where a random circulation vanishes. In the distributed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1995
ISSN: 0022-247X
DOI: 10.1006/jmaa.1995.1090